Tree-decomposable and Underconstrained Geometric Constraint Problems
نویسندگان
چکیده
A geometric constraint problem, also known as a geometric constraint system, consists of a finite set of geometric objects, such as points, lines, circles, planes, spheres, etc., and constraints upon them, such as incidence, distance, tangency, and so on. A solution of a geometric constraint problem P is a coordinate assignment for each of the geometric objects of P that places them in relation to each other such that all constraints of P are satisfied. A problem P may have a unique solution, it may have more than one solution, or it may have no solution.
منابع مشابه
Optimal decomposition and recombination of isostatic geometric constraint systems for designing layered materials
Optimal recursive decomposition (or DR-planning) is crucial for analyzing, designing, solving or finding realizations of geometric constraint sytems. While the optimal DR-planning problem is NP-hard even for general 2D bar-joint constraint systems, we describe an O(n) algorithm for a broad class of constraint systems that are isostatic or underconstrained. The algorithm achieves optimality by u...
متن کاملh-graphs: A new representation for tree decompositions of graphs
In geometric constraint solving, well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination planner based solver. In general decomposition and recombination steps can be completed only when other steps have already been completed. This fact naturally defines a hie...
متن کاملOn Tree Decomposability of Henneberg Graphs
In this work we describe an algorithm that generates well constrained geometric constraint graphs which are solvable by the treedecomposition constructive technique. The algorithm is based on Henneberg constructions and would be of help in transforming underconstrained problems into well constrained problems as well as in exploring alternative constructions over a given set of geometric elements.
متن کاملProperties of nonlinear systems and convergence of the Newton-Raphson method in geometric constraint solving
The paper describes an application of a variant of the Newton-Raphson method to solution of geometric constraint problems. Sparsity and rank deficiency of the corresponding nonlinear systems are emphasized and statistical data are presented. Several ways of handling underdeterminancy and overdeterminancy in solving the Newton linear systems are considered. The behavior of Newton’s method is sho...
متن کاملSolving over- and underconstrained geometric models
New approaches to solving underconstrained and inconsistent overconstrained 3D geometric models are described. When a model is found to be underconstrained, the underconstrained parts of the model are determined and shown to the user. The user has to add constraints to these parts, to make the model well-constrained. When an inconsistency in the model is found, the set is determined of the cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1608.05205 شماره
صفحات -
تاریخ انتشار 2016